Backup Path Classification Based on Failure Risks for Efficient Backup Path Computation

نویسندگان

  • Mohand Yazid Saidi
  • Bernard Cousin
  • Jean-Louis Le Roux
چکیده

We propose a new approach exploiting the failure risk (node, link or Shared Risk Link Group) structures to enhance the backup path computation. Upon failure, our approach classifies the backup paths into two categories: operative backup paths and inoperative backup paths. An operative backup path is an active backup path which really receives traffic of some affected communications while an inoperative backup path does not receive any traffic. With the observation that only the operative backup paths really participate to the recovery procedure, we enhance the backup path computation (1) by limiting the concurrence for the protection bandwidth allocations to the operative backup paths (instead of all the active backup paths like in the classical approaches) and (2) by reducing the set of failure risks that a backup path must bypass. Simulations shows that our approach improves the protection bandwidth allocations and decreases the ratio of rejected backup paths.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Shared Risk Link Groups to enhance backup path computation

To cope quickly with all types of failure risks (link, node and Shared Risk Link Group (SRLG)), each router detecting a failure on an outgoing interface activates locally all the backup paths protecting the primary paths which traverse the failed interface. With the observation that upon a SRLG failure, some active backup paths are inoperative and do not really participate to the recovery (sinc...

متن کامل

PLR-based heuristic for backup path computation in MPLS networks

To ensure service continuity in networks, local protection pre-configuring the backup paths is preferred to global protection. Under the practical hypothesis of single physical failures in the network, the backup paths which protect against different logical failure risks (node, link and shared risk link group (SRLG)) cannot be active at the same time. Thus, sharing bandwidth between such backu...

متن کامل

An efficient critical protection scheme for intra-domain routing using link characteristics

In recent years, there are substantial demands to reduce packet loss on the Internet. Among the proposed schemes, finding backup paths in advance is considered to be an effective method to reduce the reaction time. Very commonly, a backup path is chosen to be the most disjoint path from the primary path, or on the network level, a backup path is computed for each link (e.g., IPFRR). The validit...

متن کامل

Efficient Bandwidth Allocation for Backup Paths

In MPLS networks, failure resilience of a Label Switched Path (LSP) is essential in guaranteeing the QoS of the path. This can be achieved by allocating backup LSPs through which packets can be routed in case of primary LSP failiures. bandwidth efficiency and expeditious path restoration are two desirable features for the design of backup LSPs. This paper tackles the bandwidth efficiency with a...

متن کامل

Capacity efficient distributed routing of mesh-restored lightpaths in optical networks

A mesh-restored lightpath in an optical network has a primary route and a diversely routed backup route. The wavelength channels on the primary route of a mesh-restored lightpath are dedicated for that lightpath whereas the wavelength channels on the backup route are shared among different mesh-restored lightpaths. Wavelength channels are shared in a way that ensures restoration of all lightpat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009